Temporally relevant parallel top-k spatial keyword search

نویسندگان

چکیده

New spatio-textual indexing methods are needed to support efficient search and update of the massive amounts spatially referenced text being generated. Location based services using geo-tagged documents provide valuable ranked recommendations about nearby restaurants, services, sales, emergency events, visitor attractions. Consequently, top-k spatial keyword queries (TkSKQ) have received a lot attention from research community. Several indexes been proposed efficiently TkSKQ. Some these updates on live document streams, but ranking schemes employed by them do not simultaneously incorporate temporal relevance, textual similarity proximity. Moreover, existing approaches limited or no capability exploit parallelism with ingestion query execution. We present parallel index, Pastri, address aforementioned issues. Pastri can be updated incrementally over real-time streams. To temporally relevant continuously generated we propose dynamic scheme. Our approach retrieves that most at time implemented integrate it within system persistent store several thread pools various levels. Experimental evaluation involving real-world datasets synthetic (that created) demonstrates our is able sustain high throughput. Furthermore, Pastri's TkSKQ performance one two orders magnitude faster than other indexes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Keyword Search in Text Cube: Finding Top-k Relevant Cells

We study the problem of keyword search in a data cube with text-rich dimension(s) (so-called text cube). The text cube is built on a multidimensional text database, where each row is associated with some text data (e.g., a document) and other structural dimensions (attributes). A cell in the text cube aggregates a set of documents with matching attribute values in a subset of dimensions. A cell...

متن کامل

Top-k-size keyword search on tree structured data

Keyword search is the most popular technique for querying large tree-structured datasets, often of unknown structure, in the web. Recent keyword search approaches return lowest common ancestors (LCAs) of the keyword matches ranked with respect to their relevance to the keyword query. A major challenge of a ranking approach is the efficiency of its To face this challenge most of the known approa...

متن کامل

Efficient top-k algorithm for eXtensible Markup Language keyword search

The ability to compute top-k matches to eXtensible Markup Language (XML) queries is gaining importance owing to the increasing of large XML repositories. Current work on top-k match to XML queries mainly focuses on employing XPath, XQuery or NEXI as the query language, whereas little work has concerned on top-k match to XML keyword search. In this study, the authors propose a novel two-layer-ba...

متن کامل

Universal Top-k Keyword Search over Relational Databases

Keyword search is one of the most effective paradigms for information discovery. One of the key advantages of keyword search querying is its simplicity. There is an increasing need for allowing ordinary users to issue keyword queries without any knowledge of the database schema. The retrieval unit of keyword search queries over relational databases is different than in IR systems. While the ret...

متن کامل

Efficient Processing of Top-k Spatial Keyword Queries

Given a spatial location and a set of keywords, a top-k spatial keyword query returns the k best spatio-textual objects ranked according to their proximity to the query location and relevance to the query keywords. There are many applications handling huge amounts of geotagged data, such as Twitter and Flickr, that can benefit from this query. Unfortunately, the state-of-the-art approaches requ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Spatial Information Science

سال: 2022

ISSN: ['1948-660X']

DOI: https://doi.org/10.5311/josis.2022.24.199